Gradient algorithms for finding common Lyapunov functions
نویسندگان
چکیده
This paper is concerned with the problem of finding a quadratic common Lyapunov function for a large family of stable linear systems. We present gradient iteration algorithms which give deterministic convergence for finite system families and probabilistic convergence for infinite families.
منابع مشابه
The Computation of Common Infinity-norm Lyapunov Functions for Linear Switched Systems
Abstract. This paper studies the problem of the computation of common infinity-norm Lyapunov functions. For a set of continuous-time LTI systems or discrete-time LTI systems whose system matrices are upper triangular form or lower triangular form, it is proved that there exist common infinity-norm Lyapunov functions for them. Then four algorithms of computing common infinity-norm Lyapunov funct...
متن کاملProbabilistic sorting and stabilization of switched systems
We consider Lyapunov stability of switched linear systems whose switching signal is constrained to a subset of indices. We propose a switching rule that chooses the most stable subsystem among those belonging to the subset. This rule is based on an ordering of the subsystems using a common Lyapunov function. We develop randomized algorithms for finding the ordering as well as for finding a subs...
متن کاملRobust Lyapunov Functions for Reaction Networks: An Uncertain System Framework
We present a framework to transform the problem of finding a Lyapunov function of a Chemical Reaction Network (CRN) in concentration coordinates with arbitrary monotone kinetics into finding a common Lyapunov function for a linear parameter varying system in reaction coordinates. Alternative formulations of the proposed Lyapunov function is presented also. This is applied to reinterpret previou...
متن کاملProximal-Like Incremental Aggregated Gradient Method with Linear Convergence under Bregman Distance Growth Conditions
We introduce a unified algorithmic framework, called proximal-like incremental aggregated gradient (PLIAG) method, for minimizing the sum of smooth convex component functions and a proper closed convex regularization function that is possibly non-smooth and extendedvalued, with an additional abstract feasible set whose geometry can be captured by using the domain of a Legendre function. The PLI...
متن کاملFinding the Optimal Path to Restoration Loads of Power Distribution Network by Hybrid GA-BCO Algorithms Under Fault and Fuzzy Objective Functions with Load Variations
In this paper proposes a fuzzy multi-objective hybrid Genetic and Bee colony optimization algorithm(GA-BCO) to find the optimal restoration of loads of power distribution network under fault.Restoration of distribution systems is a complex combinatorial optimization problem that should beefficiently restored in reasonable time. To improve the efficiency of restoration and facilitate theactivity...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008